A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

The dynamic single row facility layout problem (DSRFLP) is defined as the of arranging facilities along a straight line during multi-period planning horizon with objective minimizing sum material handling and rearrangement costs. cost products flow costs center-to-center distances between facilities. In this paper, we focus on metaheuristic algorithms for problem. main contributions paper are three-fold. First, variable neighborhood search (VNS) algorithm DSRFLP proposed. version VNS uses an innovative strategy to start from solution obtained by constructing instance (SRFLP) given applying heuristic former Second, fast local (LS) procedure developed. innovations two-fold: (i) insertion swap exploration techniques adapted case SRFLP; (ii) reduce computational time, operation restricted pairs equal lengths. Provided number periods constant, procedures n have only O(n2) time complexity. superiority these over traditional LS also shown performing numerical tests. Third, experiments instances up 200 three or five carried out validate effectiveness approach. proposed compared simulated annealing (SA) method which state art DSRFLP. Experiments show that outperforms SA significant margin.